液体推进剂消耗对大型卫星结构动特性的影响分析

为了研究液体推进剂消耗对某大型卫星结构动特性的影响,采用简化的“弹簧-质量”模型分析了推进剂消耗对结构动特性的影响趋势;基于MSC.PATRAN/NASTRAN给出了动力学分析过程中液体推进剂的等效建模和分析方法,包括梁单元法、附加质量法、“RBE3 -质量点”单元法和虚拟质量法等;建立了该卫星结构的有限元模型,进行了结构动力学特性和动响应分析,讨论了液体推进剂消耗对其动特性的影响规律.研究结果表明:随着推进剂的消耗,卫星整体振型的固有频率逐渐增大,而部分局部振型的固有频率保持不变;随着推进剂的消耗,卫星仪器安装板动力学响应峰值逐渐增大,所对应的频率也逐渐增大.     

IMM-EKF的弹道导弹轨道实时动态预测

快速准确的导弹轨道预测是有效进行导弹防御的前提。提出一种基于IMM-EKF的弹道导弹轨道实时动态预测方法,对导弹发射点和落点分别进行动态预测研究。首先,构建不包含导弹先验信息的IMM-EKF弹道估计器;其次,定义一种模型概率累积因子,用于估计导弹的关机时刻及相应的运动状态;最后,基于导弹运动状态的实时估计,动态预测落点和发射点。仿真实验结果表明:该方法能实时动态预测导弹发射点和落点;发射点预测应利用主动段状态估计,而落点预测则在导弹自由段早期进行为宜。     

改进的前向信息修补算法及其应用

前向信息修补算法可以对离散动态贝叶斯网络的缺失数据进行预测,该算法只适用于所有观测节点是相互独立的网络,却不能处理观测节点有依赖关系网络的缺失数据。针对该算法的这一缺陷,提出了改进的前向信息修补算法,在分析离散动态贝叶斯网络的缺失数据具有二种基本形式的基础上,推导出了每种形式的相应预测公式。继而构建了用于识别威胁源离散动态贝叶斯网络的模型。仿真实验验证了改进的前向信息修补算法的有效性。     

新型空间绳系机器人逼近动力学建模及控制

为弥补传统空间机器人操作范围小,风险高的缺点,介绍了一种新型空间绳系机器人系统。建立其任务核心的逼近动力学模型,基于反馈线性化技术和神经网络控制技术设计智能逼近控制系统,仿真结果验证了控制系统的有效性,为新型近距离空间操作技术的发展奠定基础。     

动态滑翔运动建模、机理分析与航迹优化

信天翁凭借动态滑翔的飞行技巧从梯度风中获取能量,从而在几乎不拍翅膀的情况下进行长时间、长距离飞行,这种技巧应用于小型无人机上可拓展其完成任务的能力。基于飞行器动力学对梯度风场中的无人机运动方程进行推导和简化处理;利用简化的运动方程,分别从非惯性参考系中的动能定理和机械能变化的角度,对动态滑翔获取能量的机理进行分析;利用微分平坦法,以最小平均控制输入变化率为目标函数,对徘徊模式和平移模式的动态滑翔航迹进行优化计算。分析结果表明:逆风爬升、顺风下滑是动态滑翔基本获能方式。优化结果表明:控制输入变得更加平滑,甚至出现阶段性的常值,使得控制更加简化;徘徊模式下,当风梯度作为决策变量时,优化过程可在[0,0.5 s-1]的区间上找到使得目标函数值最小的风梯度;平移模式下,目标函数值在该区间上单调递减。     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

弹道导弹威胁估计模型构建

简要分析了弹道导弹飞行3个阶段的不同特点及各阶段导弹预警探测手段的侧重点,结合威胁估计的特征构建了弹道导弹威胁估计模型结构框架,运用多阶段贝叶斯网络理论,构造了主动段、自由段和再入段威胁估计模型,并明确了三阶段间的转换时机。采用动态贝叶斯方法对弹道导弹作战全过程进行威胁估计仿真推理,仿真结果能够反映导弹在飞行过程中威胁程度的变化特点,为反导指挥员作出辅助决策提供智力支持。     

高动态GNSS信号多普勒模拟任意阶直接数字合成器设计

为高精度模拟高动态条件下GNSS信号的多普勒特性,提出一种任意阶直接数字合成信号合成器的设计方法。设计任意阶直接数字合成信号合成器的结构;通过理论分析,推导各级累加器相位初值的计算公式;给出字长选择方法。经仿真验证,该方法能精确模拟GNSS信号的多普勒特性。此外,提出的直接数字合成器设计方法不受阶数的限制,可普遍应用于各类信号模拟器的设计。     

On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.